Solving the subset sum problem with a nonideal biological computer
نویسندگان
چکیده
Abstract We consider the solution of subset sum problem based on a parallel computer consisting self-propelled biological agents moving in nanostructured network that encodes computing task its geometry. develop an approximate analytical method to analyze effects small errors nonideal junctions composing by using Gaussian confidence interval approximation multinomial distribution. concretely evaluate probability distribution for error-induced paths and determine minimal number required obtain proper solution. finally validate our theoretical results with exact numerical simulations different set sizes error probabilities, discuss scalability realistic experimental probabilities.
منابع مشابه
Solving the Subset Sum Problem with Heap-Ordered Subset Trees
In the field of algorithmic analysis, one of the more well-known exercises is the subset sum problem. That is, given a set of integers, determine whether one or more integers in the set can sum to a target value. Aside from the brute-force approach of verifying all combinations of integers, several solutions have been found, ranging from clever uses of various data structures to computationally...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولMultidimensional Subset Sum Problem
This thesis explores new modifications to the successful LLL approach to solving the Subset Sum problem. This work is an optimization of the matrix representation of an instance. Traditionally, the basis matrix contained only one column with set elements and the sum. In this thesis we suggest having several data columns (thus introducing multidimensionality). This allows us to reduce the size o...
متن کاملSolving Low - density Subset Sum
Definition 1. Subset sum (SSUM) is the following problem: given a1, . . . , an ∈ [0, X] and s = ∑ aixi where each xi ∈ {0, 1}, find ~x = (x1, . . . , xn). Definition 2. The density of a subset sum problem is defined as n logX ; the ratio between the number of elements in your sum to the number of bits in the range of ais. Low density means n logX is very small, for example 1 n2 where X = 2 n . ...
متن کاملApproximability of the Subset Sum Reconfiguration Problem
The subset sum problem is a well-known NP-complete problem in which we wish to find a packing (subset) of items (integers) into a knapsack with capacity so that the sum of the integers in the packing is at most the capacity of the knapsack and at least a given integer threshold. In this paper, we study the problem of reconfiguring one packing into another packing by moving only one item at a ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Journal of Physics
سال: 2021
ISSN: ['1367-2630']
DOI: https://doi.org/10.1088/1367-2630/ac2005